Constrained NMF-Based Multi-View Clustering on Unmapped Data
نویسندگان
چکیده
Existing multi-view clustering algorithms require that the data is completely or partially mapped between each pair of views. However, this requirement could not be satisfied in most practical settings. In this paper, we tackle the problem of multi-view clustering for unmapped data in the framework of NMF based clustering. With the help of inter-view constraints, we define the disagreement between each pair of views by the fact that the indicator vectors of two instances from two different views should be similar if they belong to the same cluster and dissimilar otherwise. The overall objective of our algorithm is to minimize the loss function of NMF in each view as well as the disagreement between each pair of views. Experimental results show that, with a small number of constraints, the proposed algorithm gets good performance on unmapped data, and outperforms existing algorithms on partially mapped data and completely mapped data.
منابع مشابه
EquiNMF: Graph Regularized Multiview Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) methods have proved to be powerful across a wide range of real-world clustering applications. Integrating multiple types of measurements for the same objects/subjects allows us to gain a deeper understanding of the data and refine the clustering. We have developed a novel Graph-reguarized multiview NMF-based method for data integration called EquiNMF. The ...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملSparse Nonnegative Matrix Factorization for Clustering
Properties of Nonnegative Matrix Factorization (NMF) as a clustering method are studied by relating its formulation to other methods such as K-means clustering. We show how interpreting the objective function of K-means as that of a lower rank approximation with special constraints allows comparisons between the constraints of NMF and K-means and provides the insight that some constraints can b...
متن کاملMulti-Task Clustering using Constrained Symmetric Non-Negative Matrix Factorization
Researchers have attempted to improve the quality of clustering solutions through various mechanisms. A promising new approach to improve clustering quality is to combine data from multiple related datasets (tasks) and apply multi-task clustering. In this paper, we present a novel framework that can simultaneously cluster multiple tasks through balanced Intra-Task (within-task) and Inter-Task (...
متن کاملSoF: Soft-Cluster Matrix Factorization for Probabilistic Clustering
We propose SoF (Soft-cluster matrix Factorization), a probabilistic clustering algorithm which softly assigns each data point into clusters. Unlike model-based clustering algorithms, SoF does not make assumptions about the data density distribution. Instead, we take an axiomatic approach to define 4 properties that the probability of co-clustered pairs of points should satisfy. Based on the pro...
متن کامل